Tensor product Gauss-Lobatto points are Fekete points for the cube

نویسندگان

  • Len P. Bos
  • Mark A. Taylor
  • Beth A. Wingate
چکیده

Tensor products of Gauss-Lobatto quadrature points are frequently used as collocation points in spectral element methods. Unfortunately, it is not known if Gauss-Lobatto points exist in non-tensor-product domains like the simplex. In this work, we show that the n-dimensional tensor-product of Gauss-Lobatto quadrature points are also Fekete points. This suggests a way to generalize spectral methods based on Gauss-Lobatto points to nontensor-product domains, since Fekete points are known to exist and have been computed in the triangle and tetrahedron. In one dimension this result was proved by Fejér in 1932, but the extension to higher dimensions in non-trivial.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Algorithm for Computing Fekete Points in the Triangle

On the line and its tensor products, Fekete points are known to be the Gauss–Lobatto quadrature points. But unlike high-order quadrature, Fekete points generalize to non-tensor-product domains such as the triangle. Thus Fekete points might serve as an alternative to the Gauss–Lobatto points for certain applications. In this work we present a new algorithm to compute Fekete points and give resul...

متن کامل

Pseudo-spectral ‎M‎atrix and Normalized Grunwald Approximation for Numerical Solution of Time Fractional Fokker-Planck Equation

This paper presents a new numerical method to solve time fractional Fokker-Planck equation. The space dimension is discretized to the Gauss-Lobatto points, then we apply pseudo-spectral successive integration matrix for this dimension. This approach shows that with less number of points, we can approximate the solution with more accuracy. The numerical results of the examples are displayed.

متن کامل

Locating good points for multivariate polynomial approximation

Locating good points for multivariate polynomial approximation, in particular interpolation, is an open challenging problem, even in standard domains. One set of points that is always good, in theory, is the so-called Fekete points. They are defined to be those points that maximize the (absolute value of the) Vandermonde determinant on the given compact set. However, these are known analyticall...

متن کامل

Computing Fekete and Lebesgue points: Simplex, square, disk

The main purpose of our work is to provide Fekete and Lebesgue points on three basic bidimensional compact sets, the simplex, the square, and the disk, by solving numerically the corresponding large-scale nonlinear optimization problems up to degree n = 18. Our results reach and often improve those previously known [1], [3]. In the case of the simplex, due to their relevance in developing spect...

متن کامل

Hyperinterpolation in the cube

We construct an hyperinterpolation formula of degree n in the three-dimensional cube, by using the numerical cubature formula for the product Chebyshev measure given by the product of a (near) minimal formula in the square with Gauss-Chebyshev-Lobatto quadrature. The underlying function is sampled at N ∼ n/2 points, whereas the hyperinterpolation polynomial is determined by its (n + 1)(n + 2)(n...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Comput.

دوره 70  شماره 

صفحات  -

تاریخ انتشار 2001